Y-compatible and strict Y-compatible functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations

The impossibility result by Jehiel and Moldovanu says that in a setting with interdependent valuations, any efficient and ex-post incentive compatible mechanism must be a constant mechanism. Mezzetti circumvents this problem by designing a two stage mechanism where the decision of allocation and payment are split over the two stages. This mechanism is elegant, however keeps a major weakness. In...

متن کامل

Compatible and almost compatible pseudo-Riemannian metrics

In this paper, notions of compatible and almost compatible Riemannian and pseudo-Riemannian metrics, which are motivated by the theory of compatible (local and nonlocal) Poisson structures of hydrodynamic type and generalize the notion of flat pencil of metrics (this notion plays an important role in the theory of integrable systems of hydrodynamic type and the Dubrovin theory of Frobenius mani...

متن کامل

Dynamics of Responses in Compatible Potato - Potato virus Y Interaction Are Modulated by Salicylic Acid

To investigate the dynamics of the potato-Potato virus Y (PVY) compatible interaction in relation to salicylic acid-controlled pathways we performed experiments using non-transgenic potato cv. Désirée, transgenic NahG-Désirée, cv. Igor and PVY(NTN), the most aggressive strain of PVY. The importance of salicylic acid in viral multiplication and symptom development was confirmed by pronounced sym...

متن کامل

Common fixed point theorems for compatible and weakly compatible mappings

Results on common fixed points for pairs of single and multivalued mappings on a complete metric space are examined. Our work establishes a common fixed point theorem for a pair of generalized contraction self-maps and a pair of set-valued mappings.

متن کامل

Compatible Trees ∗

Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric tree whose vertex set is S. The main problem we consider in this work consists of finding a second plane geometric tree T ′ on S, such that T ′ is compatible with T and shares with T a minim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1997

ISSN: 0893-9659

DOI: 10.1016/s0893-9659(96)00115-2